A new semantic similarity join method using diffusion maps and long string table attributes
نویسندگان
چکیده
s, while we got results when applying diffusion maps with the same number of Abstracts. This showed that Diffusion Maps is the best candidate method for semantically joining attributes containing huge number of long string values. 3.4 Long string Vs Short string Evaluation In this phase, we compared Diffusion Maps Method on the Abstract Field with the SoftTFIDF short string method with the Title and
منابع مشابه
Efficient Privacy Preserving Protocols for Similarity Join
During the similarity join process, one or more sources may not allow sharing its data with other sources. In this case, a privacy preserving similarity join is required. We showed in our previous work [4] that using long attributes, such as paper abstracts, movie summaries, product descriptions, and user feedbacks, could improve the similarity join accuracy using supervised learning. However, ...
متن کاملEfficient Similarity Joinmethodusing Unsupervised Learning
This paper proposes an efficient similarity join method using unsupervised learning, when no labeled data is available. In our previous work, we showed that the performance of similarity join could improve when long string attributes, such as paper abstracts, movie summaries, product descriptions, and user feedback, are used under supervised learning, where a training set exists. In this work, ...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملPASS-JOIN: A Partition-based Method for Similarity Joins
As an essential operation in data cleaning, the similarity join has attracted considerable attention from the database community. In this paper, we study string similarity joins with edit-distance constraints, which find similar string pairs from two large sets of strings whose edit distance is within a given threshold. Existing algorithms are efficient either for short strings or for long stri...
متن کاملUser Profile Relationships using String Similarity Metrics in Social Networks
This article reviews the problem of degree of closeness and interaction level in a social network by ranking users based on similarity score. This similarity is measured on the basis of social, geographic, educational, professional, shared interests, pages liked, mutual interested groups or communities and mutual friends. The technique addresses the problem of matching user profiles in its glob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016